Some Remarks on Signature Schemes Based onthe Zero - Knowledge
نویسندگان
چکیده
In this note we consider the problem of signature forgery by the signer in digital signature schemes based on the zero-knowledge concept and propose a simple method for obtaining security against such forgery without any increase of computation complexity.
منابع مشابه
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on factoring and discrete log, but still they are practical schemes based on NP-hard problems. Among them, the problem SD of decoding linear codes is in spite of some 30 years of research effort, still exponential. We stu...
متن کاملA New Idea in Digital Signature Schemes
Since the invention of the first idea of digital signatures relied on public key algorithms many properties are added, and numerous novel schemes are developed. Besides this grow, a novel idea in identification schemes relied on public key algorithms is also presented, that is zero knowledge proof of identity. However, along with this development many remarkable schemes for instance the Fiat-Sh...
متن کاملRelaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs
Higher-level cryptographic privacy-enhancing protocols such as anonymous credentials, voting schemes, and e-cash are often constructed by suitably combining signature, commitment, and encryption schemes with zero-knowledge proofs. Indeed, a large body of protocols have been constructed in that manner from Camenisch-Lysyanskaya signatures and generalized Schnorr proofs. In this paper, we build a...
متن کاملSignature Identification Scheme Based on Iterated Function Systems
Since 1984 many schemes have been proposed for digital signature protocol, among them those that based on discrete log and factorizations. However a new identification scheme based on iterated function (IFS) systems are proposed and proved to be more efficient. In this study the proposed identification scheme is transformed into a digital signature scheme by using a one way hash function. It is...
متن کاملNew Signature Schemes with Coupons and Tight Reduction
Amongst provably secure signature schemes, two distinct classes are of particular interest: the ones with tight reduction (e.g., RSA-PSS), and those which support the use of coupons (e.g., Schnorr signature). This paper introduces a new generic signature scheme based on any zero-knowledge identification protocol Z and signature scheme S verifying basic security properties. The so-obtained signa...
متن کامل